搜索资源列表
Delaunayjiyusuiyoutuke
- 基于最优凸壳技术的Delaunay三角剖分算法-Convex Hull based on optimal technology Delaunay triangulation algorithm
93317441delanay_all
- delaunay三角剖分程序，能运行，可以显示-delaunay triangulation procedures, will be able to run, you can show that
triangulation
- 三角网剖分 将平面数据点进行三角剖分 快速构建delaunay三角网-delaunay triangulation which can triangulate the dots on the plane
delaunay_demo
- 2000个点的delaunay二维三角剖分-two demension trianglization of 2000 points
Delaunay_T945726142002
- vb lisp的三角剖分,可以稳健剖分点集-trianglization of vb-lisp
delaunay222
- vc7.0 编写的2000个点的二维三角剖分，剖分速度非常快！-very good！
voronoiView
- 针对平面内不相交的点或圆，根据三角剖分的原理，生成VORONOI图-For the plane does not intersect the point or circle, in accordance with the principles of triangulation to generate VORONOI map
geompack3
- Voronoi和delaunay三角剖分源程序软件，用于构建数值计算的有限元预处理工作-Delaunay triangulation and Voronoi source software for building a numerical calculation of the finite element pre-processing work
54635Delauney
- 三角剖分源程序对于平面插值的改进有帮助，大家多多交流-Source for the plane triangulation interpolation has helped to improve
PolygonTriangulation_src
- c#实现的简单多边形的三角剖分工程文件 -PolygonEarCutting
simple_2D_Delaunay_Triangulation
- 对已有的顶点进行三角剖分操作，仅限于二维-Triangulate the points given, limited to 2D
cutpoly
- 凸多边形的最优三角剖分的vc++实现。输入：逆时针输入凸多边形P的顶点序列p1,p2…pn. 输出：P的三角剖分序列p1p2pi，p2pipj，…，plpn-1pn及三角剖分后的最优权值之和 -Optimal convex polygon triangulation of vc++ to achieve.
Delaunay
- Delaunay三角剖分-Delaunay triangulation
Monotone_polygon_partition
- 给定一个单调多边形，基于割耳朵算法，我们可以将这个多边形三角剖分-given a monotone polygon,based on the ear-cutting method, we can get a triangle partition.
Delauney
- Delauney三角剖分,对三维的地形可进行较好的描述。-Delauney triangulation of the three-dimensional terrain can be a better descr iption.
delaunayprogramming
- 三角剖分算法，delaunay的三角剖分 三角剖分算法，delaunay的三角剖分-triangulation programming
Delaunay
- 带岛区约束数据域的Delaunay三角剖分通用算法研究(文章)，有参考价值-Band Island constrained domain of generic algorithm for Delaunay triangulation (articles), there is reference value
TrianPPS
- 计算平面点集的Delaunay三角剖分。使用DCEL数据结构。右键点击可以实现平面的直线穿刺。-Calculate the Delaunay triangulation of planar point set
sanjiaopoufen
- 实现凸多边形的三角剖分，c++源代码，拷到编译器下即可调试运行，没错误，不想下的很多程序代码调试有错误。-Achieve convex polygon triangulation, c++ source code, copying it to debug the compiler can be run under, no errors, do not want to debug code under a lot of mistakes.
RandomPointsDelaunayVc
- 在平面随机生成散列的二维点，点数可由用户输入，然后将散列的点进行三角剖分，生成三角网。可以用于算法演示，这个比较老的代码，速度并不快，也可以继续改进。-The demo can show an example of delaunay and the a algorithm is not very fast.